Optimal actions in problems with convex loss functions
نویسندگان
چکیده
منابع مشابه
Optimal actions in problems with convex loss functions
Researches in Bayesian sensitivity analysis and robustness have mainly dealt with the computation of the range of some quantities of interest when the prior distribution varies in some class. Recently, researchers’ attention turned to the loss function, mostly to the changes in posterior expected loss and optimal actions. In particular, the search for optimal actions under classes of priors and...
متن کاملConvex Optimal Control Problems with Smooth Hamiltonians
Optimal control problems with convex costs, for which Hamiltonians have Lipschitz continuous gradients, are considered. Examples of such problems, including extensions of the linear-quadratic regulator with hard and possibly state-dependent control constraints, and piecewise linear-quadratic penalties are given. Lipschitz continuous differentiability and strong convexity of the terminal cost ar...
متن کاملGeneralized B-spline functions method for solving optimal control problems
In this paper we introduce a numerical approach that solves optimal control problems (OCPs) using collocation methods. This approach is based upon B-spline functions. The derivative matrices between any two families of B-spline functions are utilized to reduce the solution of OCPs to the solution of nonlinear optimization problems. Numerical experiments confirm our heoretical findings.
متن کاملIterative Regularization for Learning with Convex Loss Functions
We consider the problem of supervised learning with convex loss functions and propose a new form of iterative regularization based on the subgradient method. Unlike other regularization approaches, in iterative regularization no constraint or penalization is considered, and generalization is achieved by (early) stopping an empirical iteration. We consider a nonparametric setting, in the framewo...
متن کاملOptimal Stochastic Quadrature Formulas For Convex Functions
We study optimal stochastic (or Monte Carlo) quadrature formulas for convex functions. While nonadaptive Monte Carlo methods are not better than deterministic methods we prove that adaptive Monte Carlo methods are much better. Abstract. We study optimal stochastic (or Monte Carlo) quadrature formulas for convex functions. While nonadaptive Monte Carlo methods are not better than deter-ministic ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Approximate Reasoning
سال: 2009
ISSN: 0888-613X
DOI: 10.1016/j.ijar.2008.03.014